Everything Totally Explained


Ask & we'll explain, totally!
Fractional Fourier transform
Totally Explained


  NEW! All the latest news in the worlds of computer gaming, entertainment, the environment,  
finance, health, politics, science, stocks & shares, technology and much, much, more.  


View this entry using RSS

Everything about Fractional Fourier Transform totally explained

In mathematics, in the area of harmonic analysis, the fractional Fourier transform (FRFT) is a linear transformation generalizing the Fourier transform. It can be thought of as the Fourier transform to the n-th power where n need not be an integer — thus, it can transform a function to an intermediate domain between time and frequency. Its applications range from filter design and signal analysis to phase retrieval and pattern recognition. The FRFT can be used to define fractional convolution, correlation, and other operations, and can also be further generalized into the linear canonical transformation (LCT). An early definition of the FRFT was given by Namias (1980), but it wasn't widely recognized until it was independently reinvented around 1993 by several groups of researchers (Almeida, 1994).
   A completely different meaning for "fractional Fourier transform" was introduced by Bailey and Swartztrauber (1991) as essentially another name for a z-transform, and in particular for the case that corresponds to a discrete Fourier transform shifted by a fractional amount in frequency space (multiplying the input by a linear chirp) and evaluating at a fractional set of frequency points (for example considering only a small portion of the spectrum). (Such transforms can be evaluated efficiently by Bluestein's FFT algorithm.) This terminology has fallen out of use in most of the technical literature, however, in preference to the FRFT. The remainder of this article describes the FRFT.
   See also the chirplet transform for a related generalization of the Fourier transform.

Definition

If the continuous Fourier transform of a function f(t) is denoted by mathcal_alpha(f) must be simply f(t) or f(-t) for alpha an even or odd multiple of pi, respectively.
   There also exist related fractional generalizations of similar transforms such as the discrete Fourier transform.

Physical Meaning of the Fractional Fourier Transform

The physical meaning of the Fourier transform is as a transformation of a time domain signal into a frequency domain signal. On the other hand, the physical meaning of the inverse Fourier transform is as a transformation of a frequency domain signal into a time domain signal. Apparently, fractional Fourier transform can transform a signal (either in the time domain or frequency domain) into the domain between time and frequency.
   Take the below figure as an example. If the signal in the time domain is rectangular (as below), it'll become a sinc function in the frequency domain. But if we apply the fractional Fourier transform to the rectangular signal, the transformation output will be in the domain between time and frequency.


Actually, fractional Fourier transform is a rotation operation on the time frequency distribution. From the definition above, for α=0, there will be no change after applying fractional Fourier transform, and for α=π/2, fractional Fourier transform becomes a Fourier transform, which rotates the time frequency distribution with π/2. For other value of α, fractional Fourier transform rotates the time frequency distribution according to α. The following figure shows the results of the fractional Fourier transform with different values of α.

Application

Fractional Fourier transform can be used in time frequency analysis and DSP. It is useful to filter noise, but with the condition that it doesn't overlap with the desired signal in the time frequency domain. Let’s see the following example. We can't apply a filter directly to eliminate the noise, but with the help of the fractional Fourier transform, we can rotate the signal (including the desired signal and noise) first. We then apply a specific filter which will allow only the desired signal to pass. Thus the noise will be removed completely. Then we use the fractional Fourier transform again to rotate the signal back and we can get the desired signal.

Further Information

Get more info on 'Fractional Fourier Transform'.


External Link Exchanges

Do you know how hard it is to get a link from a large encyclopaedia? Well we're different and will prove it. To get a link from us just add the following HTML to your site on a relevant page:

    <a href="http://fractional_fourier_transform.totallyexplained.com">Fractional Fourier transform Totally Explained</a>

Then simply click through this link from your web page. Our crawlers will verify your link, extract the title of your web page and instantly add a link back to it. If you like you can remove the words Totally Explained and embed the link in article text.
   As long as your link remains in place, we'll keep our link to you right here. Please play fair - our crawlers are watching. Your site must be closely related to this one's topic. Any kind of spamming, dubious practises or removing the link will result in your link from us being dropped and, potentially, your whole site being banned.



Copyright © 2007-8 totallyexplained.com | Licensed under the GNU Free Documentation License | Site Map
This article contains text from the Wikipedia article Fractional Fourier transform (History) and is released under the GFDL | RSS Version